Springer LINK: Lecture Notes in Computer Science

| Full article in PDF (178 KB) Computational Biology Computing the Threshold for -Gram Filters Juha KärkkäinenLNCS 2368, p. 348 ff.Abstract | Full article in PDF (173 KB) On the Generality of Phylogenies from Incomplete Directed CharactersItsik Pe'er, Ron Shamir, and Roded SharanLNCS 2368, p. 358 ff.Abstract | Full article in PDF (193 KB) Data Storage and Manipulation Sorting with a ForkliftM.H. Albert and M.D. AtkinsonLNCS 2368, p. 368 ff.Abstract | Full article in PDF (117 KB) Tree Decompositions with Small CostHans L. Bodlaender and Fedor V. FominLNCS 2368, p. 378 ff.Abstract | Full article in PDF (166 KB) Computing the Treewidth and the Minimum Fill-in with the Modular DecompositionHans L. Bodlaender and Udi RoticsLNCS 2368, p. 388 ff.Abstract | Full article in PDF (164 KB) Performance Tuning an Algorithm for Compressing Relational TablesJyrki Katajainen and Jeppe Nejsum MadsenLNCS 2368, p. 398 ff.Abstract | Full article in PDF (147 KB) A Randomized In-Place Algorithm for Positioning the Element in a MultisetJyrki Katajainen and Tomi A. PasanenLNCS 2368, p. 408 ff.Abstract | Full article in PDF (165 KB) Paging on a RAM with Limited ResourcesTony W. LaiLNCS 2368, p. 418 ff.Abstract | Full article in PDF (105 KB)Springer LINK: Lecture Notes in Computer Science http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (6 of 7) [9/30/2002 10:21:43 PM] An Optimal Algorithm for Finding NCA on Pure Pointer MachinesA. Dal Palú, E. Pontelli, and D. RanjanLNCS 2368, p. 428 ff.Abstract | Full article in PDF (173 KB) Amortized Complexity of Bulk Updates in AVL-TreesEljas Soisalon-Soininen and Peter WidmayerLNCS 2368, p. 439 ff.Abstract | Full article in PDF (139 KB) Author IndexLNCS 2368, p. 449 ff.Author Index in PDF (18 KB) Online publication: June 21, [email protected] © Springer-Verlag Berlin Heidelberg 2002Springer LINK: Lecture Notes in Computer Science http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (7 of 7) [9/30/2002 10:21:43 PM] An Efficient Quasidictionary Torben Hagerup1 and Rajeev Raman2 1 Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt,D–60054 Frankfurt am Main. [email protected] 2 Department of Maths and Computer Science, University of Leicester,Leicester LE1 7RH, UK. [email protected] Abstract. We define a quasidictionary to be a data structure thatsupports the following operations: check-in(v) inserts a data item vand returns a positive integer tag to be used in future references to v;check-out(x) deletes the data item with tag x; access(x) inspects and/ormodifies the data item with tag x. A quasidictionary is similar to adictionary, the difference being that the names identifying data itemsare chosen by the data structure rather than by its user. We describe adeterministic quasidictionary that executes the operations check-in andaccess in constant time and check-out in constant amortized time, worksin linear space, and uses only tags bounded by the maximum number ofdata items stored simultaneously in the quasidictionary since it was lastempty. We define a quasidictionary to be a data structure thatsupports the following operations: check-in(v) inserts a data item vand returns a positive integer tag to be used in future references to v;check-out(x) deletes the data item with tag x; access(x) inspects and/ormodifies the data item with tag x. A quasidictionary is similar to adictionary, the difference being that the names identifying data itemsare chosen by the data structure rather than by its user. We describe adeterministic quasidictionary that executes the operations check-in andaccess in constant time and check-out in constant amortized time, worksin linear space, and uses only tags bounded by the maximum number ofdata items stored simultaneously in the quasidictionary since it was lastempty.